Lattice-Based Ring Signature Scheme under the Random Oracle Model
نویسندگان
چکیده
Abstract: On the basis of the signatures scheme without trapdoors from lattice, which is proposed by Vadim Lyubashevsky in 2012, we present a new ring signature scheme from lattice. The proposed ring signature scheme is an extension of the signatures scheme without trapdoors. We proved that our scheme is strongly unforgeable against adaptive chosen message in the random oracle model, and proved that the security of our scheme can be reduced to the hardness of the small integer solution (SIS) problem by rejection samplings. Compared with the existing latticebased ring signature schemes, our new scheme is more efficient and with shorter signature length.
منابع مشابه
Ring Signature and Identity-Based Ring Signature from Lattice Basis Delegation
In this paper, we propose a set of ring signature (RS) schemes and identity-based ring signature (IBRS) schemes using the lattice basis delegation technique due to [10,22]. The schemes are unforgeable and hold anonymity in the random oracle model. Using the method in [28,29], we also extend our constructions to obtain RS and IBRS schemes in the standard model. Our proposed ring signature scheme...
متن کاملLattice-based Strong Designate Verifier Signature and Its Applications
Motivated by the need to have secure strong designate verifier signatures (SDVS) even in the presence of quantum computers, a post-quantum lattice-based SDVS scheme is proposed based on the hardness of the short integer solution problem (SIS) and the learning with errors problem (LWE). The proposed SDVS scheme utilizes the Bonsai trees and pre-image sample-able function primitives to generate t...
متن کاملAdapting Lyubashevsky's Signature Schemes to the Ring Signature Setting
Basing signature schemes on strong lattice problems has been a long standing open issue. Today, two families of lattice-based signature schemes are known: the ones based on the hash-andsign construction of Gentry et al.; and Lyubashevsky’s schemes, which are based on the Fiat-Shamir framework. In this paper we show for the first time how to adapt the schemes of Lyubashevsky to the ring signatur...
متن کاملA Threshold Ring Signature Scheme with a Variety of Keys
In this paper we present a (t, n)-ring signature scheme in which each ring member can use a different underlying signature scheme. The scheme is existentially secure in the random oracle model against adaptive chosenmessage attacks in which an adversary may corrupt up to t−1 ring members, under the security assumptions of the underlying signature schemes for each ring member. The threshold sign...
متن کاملConstant Size Ring Signature Without Random Oracle
Ring signature enables an user to anonymously sign a message on behalf of a group of users termed as ‘ring’ formed in an ‘ad-hoc’ manner. A naive scheme produces a signature linear in the size of the ring, but this is extremely inefficient when ring size is large. Dodis et al. proposed a constant size scheme in EUROCRYPT’13, but provably secure in random oracle model. Best known result without ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1405.3177 شماره
صفحات -
تاریخ انتشار 2014